Approximate Dynamic Programming for Large-scale Unit Commitment Problems
نویسندگان
چکیده
منابع مشابه
Approximate Dynamic Programming for Large-Scale Resource Allocation Problems
We present modeling and solution strategies for large-scale resource allocation problems that take place over multiple time periods under uncertainty. In general, the strategies we present formulate the problem as a dynamic program and replace the value functions with tractable approximations. The approximations of the value functions are obtained by using simulated trajectories of the system a...
متن کاملMathematical Programming bounds for Large-Scale Unit Commitment Problems in Medium-Term Energy System Simulations
We consider a large-scale unit commitment problem arising in medium-term simulation of energy networks, stemming from a joint project between the University of Milan and a major energy research centre in Italy. Optimal plans must be computed for a set of thermal and hydroelectric power plants, located in one or more countries, over a time horizon spanning from a few months to one year, with a h...
متن کاملUnit Commitment Solution using Fuzzy Dynamic Programming
Fuzzy Dynamic Programming approach to the solution of unit commitment problem is presented and described in detail. The Fuzzy Dynamic programming provides the ‘fuzzy’ preference in obtaining an optimal solution in the presence of conflicting objectives and constraints. The Fuzzy dynamic programming handles one objective (i.e. minimization of operational cost) and two constraints (i.e. generatio...
متن کاملApproximate Dynamic Programming for High-Dimensional Problems
There is a wide range of simulation problems that involve making decisions during the simulation, where we would like to make the best decisions possible, taking into account not only what we know when we make the decision, but also the impact of the decision on the future. Such problems can be formulated as dynamic programs, stochastic programs and optimal control problems, but these technique...
متن کاملApproximate Dynamic Programming for Storage Problems
Storage problems are an important subclass of stochastic control problems. This paper presents a new method, approximate dynamic programming for storage, to solve storage problems with continuous, convex decision sets. Unlike other solution procedures, ADPS allows math programming to be used to make decisions each time period, even in the presence of large state variables. We test ADPS on the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Environment, Energy and Earth Sciences
سال: 2018
ISSN: 2475-8833
DOI: 10.12783/dteees/appeec2018/23542